recursion theorem - traducción al ruso
Diclib.com
Diccionario ChatGPT
Ingrese una palabra o frase en cualquier idioma 👆
Idioma:

Traducción y análisis de palabras por inteligencia artificial ChatGPT

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

  • cómo se usa la palabra
  • frecuencia de uso
  • se utiliza con más frecuencia en el habla oral o escrita
  • opciones de traducción
  • ejemplos de uso (varias frases con traducción)
  • etimología

recursion theorem - traducción al ruso

WIKIMEDIA DISAMBIGUATION PAGE
Recursion Theorem

recursion theorem         

математика

теорема о рекурсии

divergence theorem         
  • n}}
  • A volume divided into two subvolumes. At right the two subvolumes are separated to show the flux out of the different surfaces.
  • The volume can be divided into any number of subvolumes and the flux out of ''V'' is equal to the sum of the flux out of each subvolume, because the flux through the <span style="color:green;">green</span> surfaces cancels out in the sum. In (b) the volumes are shown separated slightly, illustrating that each green partition is part of the boundary of two adjacent volumes
  • </math> approaches <math>\operatorname{div} \mathbf{F}</math>
  • The divergence theorem can be used to calculate a flux through a [[closed surface]] that fully encloses a volume, like any of the surfaces on the left. It can ''not'' directly be used to calculate the flux through surfaces with boundaries, like those on the right. (Surfaces are blue, boundaries are red.)
  • The vector field corresponding to the example shown. Vectors may point into or out of the sphere.
GENERALIZATION OF THE FUNDAMENTAL THEOREM IN VECTOR CALCULUS
Gauss' theorem; Gauss's theorem; Gauss theorem; Ostrogradsky-Gauss theorem; Ostrogradsky's theorem; Gauss's Theorem; Divergence Theorem; Gauss' divergence theorem; Ostrogradsky theorem; Gauss-Ostrogradsky theorem; Gauss Ostrogradsky theorem; Gauss–Ostrogradsky theorem

математика

теорема о дивергенции

теорема Гаусса-Остроградского

formal theorem         
  • planar]] map with five colors such that no two regions with the same color meet. It can actually be colored in this way with only four colors. The [[four color theorem]] states that such colorings are possible for any planar map, but every known proof involves a computational search that is too long to check by hand.
  • universality]]) resembles the [[Mandelbrot set]].
  • strings of symbols]] may be broadly divided into [[nonsense]] and [[well-formed formula]]s. A formal language can be thought of as identical to the set of its well-formed formulas. The set of well-formed formulas may be broadly divided into theorems and non-theorems.
IN MATHEMATICS, A STATEMENT THAT HAS BEEN PROVED
Theorems; Proposition (mathematics); Theorum; Mathematical theorem; Logical theorem; Formal theorem; Theorem (logic); Mathematical proposition; Hypothesis of a theorem

математика

формальная теорема

Definición

tail recursion
<programming> When the last thing a function (or procedure) does is to call itself. Such a function is called tail recursive. A function may make several recursive calls but a call is only tail-recursive if the caller returns immediately after it. E.g. f n = if n < 2 then 1 else f (f (n-2) + 1) In this example both calls to f are recursive but only the outer one is tail recursive. Tail recursion is a useful property because it enables {tail recursion optimisation}. If you aren't sick of them already, see recursion and {tail recursion}. [Jargon File] (2006-04-16)

Wikipedia

Recursion theorem

Recursion theorem can refer to:

  • The recursion theorem in set theory
  • Kleene's recursion theorem, also called the fixed point theorem, in computability theory
  • The master theorem (analysis of algorithms), about the complexity of divide-and-conquer algorithms
¿Cómo se dice recursion theorem en Ruso? Traducción de &#39recursion theorem&#39 al Ruso